Random Walk and Hyperplane Arrangements

نویسندگان

  • Kenneth S. Brown
  • KENNETH S. BROWN
چکیده

Let C be the set of chambers of a real hyperplane arrangement. We study a random walk on C introduced by Bidigare, Hanlon, and Rockmore. This includes various shuuing schemes used in computer science, biology, and card games. It also includes random walks on zonotopes and zonotopal tilings. We nd the stationary distributions of these Markov chains, give good bounds on the rate of convergence to stationarity, and prove that the transition matrices are diagonalizable. The results are extended to oriented matroids.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Descent algebras, hyperplane arrangements, and shuffling cards. To appear

This note establishes a connection between Solomon’s descent algebras and the theory of hyperplane arrangements. It is shown that card-shuffling measures on Coxeter groups, originally defined in terms of descent algebras, have an elegant combinatorial description in terms of random walk on the chambers of hyperplane arrangements. As a corollary, a positivity conjecture of Fulman is proved.

متن کامل

v 4 [ m at h . C O ] 1 5 Ju l 1 99 9 Descent Algebras , Hyperplane Arrangements , and Shuffling Cards

Two notions of riffle shuffling on finite Coxeter groups are given: one using Solomon’s descent algebra and another using random walk on chambers of hyperplane arrangements. These coincide for types A,B,C, H3, and rank two groups. Both notions have the same, simple eigenvalues. The hyperplane definition is especially natural and satisfies a positivity property when W is crystallographic and the...

متن کامل

Descent Algebras , Hyperplane Arrangements , and Shuffling Cards

Abstract Two notions of riffle shuffling on finite Coxeter groups are given: one using Solomon’s descent algebra and another using random walk on chambers of hyperplane arrangements. These definitions coincide for types A,B,H3, and rank two groups. Both notions satisfy a convolution property and have the same simple eigenvalues. The hyperplane definition is especially natural and satisfies a po...

متن کامل

Convex hulls of random walks, hyperplane arrangements, and Weyl chambers

We give an explicit formula for the probability that the convex hull of an n-step random walk in R does not contain the origin, under the assumption that the distribution of increments of the walk is centrally symmetric and puts no mass on affine hyperplanes. This extends the formula by Sparre Andersen (Skand Aktuarietidskr 32:27–36, 1949) for the probability that such random walk in dimension ...

متن کامل

1 M ay 2 00 8 RANDOM WALKS , ARRANGEMENTS , CELL COMPLEXES , GREEDOIDS , AND SELF - ORGANIZING LIBRARIES

The starting point is the known fact that some much-studied random walks on permutations, such as the Tsetlin library, arise from walks on real hyperplane arrangements. This paper explores similar walks on complex hyperplane arrangements. This is achieved by involving certain cell complexes naturally associated with the arrangement. In a particular case this leads to walks on libraries with sev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007